An O(log(n)) Fully Dynamic Algorithm for Maximum matching in a tree
نویسندگان
چکیده
In this paper, we have developed a fully-dynamic algorithm for maintaining cardinality of maximum-matching in a tree using the construction of top-trees. The time complexities are as follows: 1. Initialization Time: O(n(log(n))) to build the Top-tree. 2. Update Time: O(log(n)) 3. Query Time: O(1) to query the cardinality of maximum-matching and O(log(n)) to find if a particular edge is matched.
منابع مشابه
ar X iv : 1 10 3 . 11 09 v 2 [ cs . D S ] 1 5 A pr 2 01 2 Fully dynamic maximal matching in O ( log n ) update time
We present an algorithm for maintaining maximal matching in a graph under addition and deletion of edges. Our data structure is randomized that takes O(log n) expected amortized time for each edge update where n is the number of vertices in the graph. While there is a trivial O(n) algorithm for edge update, the previous best known result for this problem was due to Ivković and Llyod[4]. For a g...
متن کاملPoly - Logarithmic Deterministic Fully - Dynamic GraphAlgorithms I : Connectivity and Minimum Spanning Tree
Deterministic fully dynamic graph algorithms are presented for con-nectivity and minimum spanning forest. For connectivity, starting with no edges, the amortized cost for maintaining a spanning forest is O(log 2 n) per update, i.e. per edge insertion or deletion. Deciding connectivity between any two given vertices is done in O(log n= log log n) time. This matches the previous best randomized b...
متن کاملMaintaining Minimum Spanning Trees in Dynamic Graphs
We present the first fully dynamic algorithm for maintaining a minimum spanning tree in time o( √ n) per operation. To be precise, the algorithm uses O(n1/3 log n) amortized time per update operation. The algorithm is fairly simple and deterministic. An immediate consequence is the first fully dynamic deterministic algorithm for maintaining connectivity and, bipartiteness in amortized time O(n1...
متن کاملMaintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs
We present a fully dynamic algorithm for maintaining approximate maximum weight matching in general weighted graphs. The algorithm maintains a matchingM whose weight is at least 1 8M ∗ where M∗ is the weight of the maximum weight matching. The algorithm achieves an expected amortized O(logn log C) time per edge insertion or deletion, where C is the ratio of the weights of the highest weight edg...
متن کاملParallel Algorithm for Cograph Recognition with Applications
We present a parallel algorithm for recognizing cographs and constructing their cotrees. The algorithm takes O(log 2 n) time with O(n + m) processors on a CRCW PRAM, where n and m are the number of vertices and edges of the graph. Using cotree representation, we obtain parallel algorithms for solving the maximum matching and the permutation representation problems for cographs using O(logn) tim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0901.2900 شماره
صفحات -
تاریخ انتشار 2009